Hybrid Surface Partitioning of Finite Element Meshes

نویسندگان

  • Jie Shen
  • Yuqing Song
  • David Yoon
  • ShengDong Liu
چکیده

A hybrid automatic and interactive scheme is developed for partitioning the surfaces of mechanical parts represented by finite element meshes on the basis of geometric discontinuity. Given a finite element surface mesh M in three dimensions, the algorithm firstly finds a partition of M into k subregions k M M ,..., 1 on the basis of 1 G discontinuities in an automatic manner. Secondly, an interactive approach is proposed to decompose surface meshes further w.r.t. 2 G discontinuity in reference to surface curvatures. The overall computational complexity is ) log ( n n O , where n is the maximum between the numbers of elements and vertices in M , respectively. Numerical experiments have been conducted to show the effectiveness of our algorithm and its application in shape morphing or optimization.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

OPTIMAL DECOMPOSITION OF FINITE ELEMENT MESHES VIA K-MEDIAN METHODOLOGY AND DIFFERENT METAHEURISTICS

In this paper the performance of four well-known metaheuristics consisting of Artificial Bee Colony (ABC), Biogeographic Based Optimization (BBO), Harmony Search (HS) and Teaching Learning Based Optimization (TLBO) are investigated on optimal domain decomposition for parallel computing. A clique graph is used for transforming the connectivity of a finite element model (FEM) into that of the cor...

متن کامل

A unified framework of multi-objective cost functions for partitioning unstructured finite element meshes

Good performance of parallel finite element computations on unstructured meshes requires high-quality mesh partitioning. Such a decomposition task is normally done by a graph-based partitioning approach. However, the main shortcoming of graph partitioning algorithms is that minimizing the so-called edge cut is not entirely the same as minimizing the communication overhead. This paper thus propo...

متن کامل

Slices: A Scalable Partitioner for Finite Element Meshes

A pasallcl partitioned for partitioning unstructured finite element meshes on distributed memory architectures is developed. The, element based partitioned can handle mixtures of different element types. All algoritlnns adopted in the partitioned are scalable, including a communication template for ullpredictable incoming messages, as shown in actual timing measurements.

متن کامل

Partition of Unstructured Finite Element Meshes by a Multilevel Approach

We consider the topic of partitioning unstructured finite element meshes by a class of multilevel graph partitioning algorithms. Two issues are studied, where the first issue concerns the coarsening phase in such multilevel graph partitioning algorithms. In particular, we propose a new heuristic for matching the vertices of a graph during the coarsening phase. We compare our heuristic with two ...

متن کامل

Partitioning unstructured meshes using a distributed optimization model

Large meshes computations arise in many large-scale scientific and engineering problems, including finite volume methods for computational fluid dynamics, and finite element methods for structure analysis. If these meshes have to be solved efficiently on distributed memory parallel processors, a partitioning strategy should be designed so that on the one hand, processors have approximately equa...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006